The Non-Constant-Sum Colonel Blotto Game
نویسندگان
چکیده
We have benefited from the helpful comments of Dan Kovenock, Wolfgang Leininger, and participants in the presentation at the CESifo Summer Institute Workshop on Advances in the Theory of Contests and its Applications. Brian Roberson Miami University, Department of Economics, Richard T. Farmer School of Business, 208 Laws Hall, Oxford, OH 45056-3628 USA t: 513-529-0416, f: 513-529-8047, E-mail: [email protected] (Correspondent)
منابع مشابه
Pure strategy Nash equilibria in non-zero sum colonel Blotto games
We analyze a Colonel Blotto game in which opposing parties have di¤ering relative intensities (i.e. the game is non-zero sum). We characterize the colonels payo¤s that sustain a pure strategy equilibrium and present an algorithm that reaches the equilibrium actions (when they exist). Finally we show that the set of games with a pure strategy equilibria is non-empty. JEL Classi cation: C72, D7,...
متن کاملAn experimental investigation of colonel blotto games
This article examines behavior in the Colonel Blotto game with asymmetric forces. In this constant-sum game, two players simultaneously allocate their forces across n-battlefields, with the objective of maximizing the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a battlefield is deterministic, th...
متن کاملFrom Battlefields to Elections: Winning Strategies of Blotto and Auditing Games
Mixed strategies are often evaluated based on the expected payoff that they guarantee. This is not always desirable. In this paper, we consider games for which maximizing the expected payoff deviates from the actual goal of the players. To address this issue, we introduce the notion of a (u, p)-maxmin strategy which ensures receiving a minimum utility of u with probability at least p. We then g...
متن کاملFrom Duels to Battlefields: Computing Equilibria of Blotto and Other Games
We study the problem of computing Nash equilibria of zero-sum games. Many natural zerosum games have exponentially many strategies, but highly structured payoffs. For example, in the well-studied Colonel Blotto game (introduced by Borel in 1921), players must divide a pool of troops among a set of battlefields with the goal of winning (i.e., having more troops in) a majority. The Colonel Blotto...
متن کاملGeneralizations of the General Lotto and Colonel Blotto Games∗
In this paper, we generalize the General Lotto game (budget constraints satisfied in expectation) and the Colonel Blotto game (budget constraints hold with probability one) to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for the players to have asymmetric resource constraints. We completely characterize Nash equilibrium in the ge...
متن کامل